Rényi entropy and negativity for massless complex boson at conformal interfaces and junctions

نویسندگان

چکیده

A bstract We consider the ground state of a theory composed by M species massless complex bosons in one dimension coupled together via conformal interface. compute both Rényi entropy and negativity generic partition wires, generalizing approach developed recent work for free fermions. These entanglement measures show logarithmic growth with system size, universal prefactor depends on details interface bipartition. test our analytical predictions against exact numerical results harmonic chain.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smooth Entropy and Rényi Entropy

The notion of smooth entropy allows a unifying, generalized formulation of privacy ampli-cation and entropy smoothing. Smooth entropy is a measure for the number of almost uniform random bits that can be extracted from a random source by probabilistic algorithms. It is known that the R enyi entropy of order at least 2 of a random variable is a lower bound for its smooth entropy. On the other ha...

متن کامل

Rényi entropy and quantization for densities

Abstract—A random variable Z taking value in a finite, nonatomic measure space (X,M, μ) and whose distribution is absolutely continuous with respect to μ is to be described using N labels. We seek the labeling that minimizes the ρ-th moment of the μ-volume of the set of points in X that have the same label as Z. The large-N asymptotics of this minimum are expressed in terms of the Rényi entropy...

متن کامل

Entropy Power Inequality for the Rényi Entropy

The classical entropy power inequality is extended to the Rényi entropy. We also discuss the question of the existence of the entropy for sums of independent random variables.

متن کامل

Encoding Tasks and Rényi Entropy

A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum ρ-th moment of the number of performed tasks are derived. The case where a sequence of tasks is produced by a source and n tasks are jointly described using nR bits is considered. If R is larger than ...

متن کامل

The Rate of Rényi Entropy for Irreducible Markov Chains

In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2022

ISSN: ['1127-2236', '1126-6708', '1029-8479']

DOI: https://doi.org/10.1007/jhep11(2022)105